منابع مشابه
A From security protocols to pushdown automata
We study the problem of checking equivalence of security protocols for an unbounded number of sessions. Since replication leads very quickly to undecidability (even in the simple case of secrecy), we focus on a limited fragment of protocols (standard primitives but pairs, one variable per protocol’s rules) for which the secrecy preservation problem is known to be decidable. Surprisingly, this f...
متن کاملFrom $\mu$-Regular Expressions to Pushdown Automata
We extend Antimirov’s partial derivatives from regular expressions to μ-regular expressions that describe context-free languages. We prove the correctness of partial derivatives as well as the finiteness of the set of iterated partial derivatives. The latter are used as pushdown symbols in our construction of a nondeterministic pushdown automaton, which generalizes Antimirov’s NFA construction.
متن کاملAdding Time to Pushdown Automata
In this tutorial, we describe a timed extension of the widely used model of Pushdown Automata (PDA) [2, 1]. A PDA computes by moving between states according to some given transition rules. Additionally, a PDA may utilize a stack to store information. This information is encoded in stack symbols, and the PDA may add a symbol (push) to or remove a symbol (pop) from the stack. The defining featur...
متن کاملPushdown Automata
Families of Languages AFL thm if F is closed under substitution with λ-free regular sets, morphism, union with regular sets [easy for cfg] & intersection with regular sets, then F is closed under inverse morphism Figure 26: closure properties of CF II 12 intersection with regular languages a;A/α a a;A/α λ;A/α λ;A/α { } } { ⇒ ⇒ { anbn | n ≥ 1 }∗ ∩ { w ∈ {a, b}∗ |#ax even } r1 p1 q1 r0 p0 q0 r p ...
متن کاملVisibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds for a number of studied preorders and equivalences like simulation, completed simulation, ready simu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2015
ISSN: 1529-3785,1557-945X
DOI: 10.1145/2811262